Stereo Matching by Joint Energy Minimization

نویسندگان

  • Hongyang Xue
  • Deng Cai
چکیده

In [7], Mozerov et al. propose to perform stereo matching as a twostep energy minimization problem. They formulate cost filtering as a local energy minimization model, and solve the fully connected MRF model and the locally connected MRF model sequentially. In this paper we intend to combine the two steps of energy minimization in order to improve stereo matching results. We propose to jointly solve the fully connected and locally connected models, taking both their advantages into account. The joint model is solved by mean field approximations and the experiments show that the locally connected potential makes up for the loss caused by fast approximations. While remaining efficient, our joint model outperforms the two-step energy minimization approach on the Middlebury stereo benchmark.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast global stereo matching via energy pyramid minimization

We define a global matching framework based on energy pyramid, the Global Matching via Energy Pyramid (GM-EP) algorithm, which estimates the disparity map from a single stereo-pair by solving an energy minimization problem. We efficiently address this minimization by globally optimizing a coarse to fine sequence of sparse Conditional Random Fields (CRF) directly defined on the energy. This glob...

متن کامل

Stereo Video Disparity Estimation Using Multi-wavelets

Disparity estimation in stereo video processing is a crucial step in the generation of a 3D view of a scene. In this paper, a multi-wavelet based stereo correspondence matching technique for video is proposed. A multi-wavelet transform is first applied to a pair of stereo frames. Correspondence matching is initially performed at the coarsest level and relies on coarse-to-fine refinement in orde...

متن کامل

Fast Segmentation-based Dense Stereo from Quasi-dense Matching

We propose a segmentation-based dense stereo algorithm within an energy minimization framework. The cost function includes a new consistency term to take into account an initial quasi-dense disparity map and handles occlusions explicitly. Based on quasi-dense matching and color segmentation, optimization is performed efficiently by assuming a constant disparity for each region. The assumption i...

متن کامل

Feature-Based Stereo Matching Using Graph Cuts

In this paper, we present a novel feature point based stereo matching algorithm with global energy minimization. The initial disparity map is estimated by considering matching SURF key points between two images inside each homogeneous colour region by an adaptive box matching approach. Next, we improve the initial disparity map with a RANSAC based plane fitting technique which relies on accurac...

متن کامل

Occlusion and Error Detection for Stereo Matching and Hole-Filling Using Dynamic Programming

Occlusion is the key and challenging problem in stereo matching, because the results from depth maps are significantly influenced by occlusion regions. In this paper, we propose a method for occlusion and error regions detection and for efficient holefilling based on an energy minimization. First, we implement conventional global stereo matching algorithms to estimate depth information. Exploit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1601.03890  شماره 

صفحات  -

تاریخ انتشار 2016